#include<iostream>
#include<algorithm>
using namespace std;
const int N = 1e3 + 10;
int f[N][N];
int n, m;
void floyd()
{
	for (int k = 1; k <= n; k++) {
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++) {
				f[i][j] = min(f[i][j], f[i][k] + f[k][j]);
			}
		}
	}
}
int main()
{
	cin >> n >> m;
	memset(f, 0x3f, sizeof(f));
	for (int i = 1; i <= n; i++) {
		f[i][i] = 0;
	}
	while (m--) {
		int a, b, c;
		cin >> a >> b >> c;
		f[a][b] = f[b][a] = min(f[a][b], c);
	}
	return 0;
}